Interconnected Networks by Antonios Garas

Author:Antonios Garas
Language: eng
Format: epub
Publisher: Springer International Publishing, Cham

There are three possibilities when following an arbitrarily chosen edge of a given type: (i) with probability X s we encounter a type s infinite subtree (ii) with probability R s we encounter a vertex which has a connection to an infinite subtree of the opposite type, but none of the same type. Such a vertex is part of the giant viable cluster if the parent vertex was; or (iii) with probability , we encounter a vertex which has no connections to infinite subtrees of either kind. These probabilities are represented graphically in Fig. 6.7. We will use these symbols in subsequent diagrams.

To examine these avalanches, we define the probability R s , to be the probability that, on following an edge of type s, we encounter a vulnerable vertex (probability 1 − f), which has not been removed due to random damage (probability p) and has at least one child edge of each type n ≠ s leading to a subtree defined by the probability Z n , and zero of type s. That is

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.